翻訳と辞書 Words near each other ・ Bluin' the Black Keys ・ Bluing ・ Bluing (fabric) ・ Bluing (steel) ・ Bluish flowerpiercer ・ Bluish-fronted jacamar ・ Bluish-slate antshrike ・ Bluit, New Mexico ・ Blukat Rural District ・ Bluke ・ Blukis ・ Blum ・ Blum & Poe ・ Blum (film) ・ Blum Affair ・ Blum axioms ・ Blum Basin Falls ・ Blum Blum Shub ・ Blum Capital ・ Blum Creek ・ Blum Independent School District ・ Blum integer ・ Blum Lakes ・ Blum Stadium ・ Blum's speedup theorem ・ Blum, Texas ・ Blum-Viollette proposal ・ Bluma ・ Bluma Appel ・ Bluma Tischler Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Blum axioms ： ウィキペディア英語版 Blum axioms In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on the set of computable functions. The axioms were first defined by Manuel Blum in 1967. Importantly, the Speedup and Gap theorems hold for any complexity measure satisfying these axioms. The most well-known measures satisfying these axioms are those of time (i.e., running time) and space (i.e., memory usage). == Definitions == A Blum complexity measure is a tuple $(\backslash varphi,\; \backslash Phi)$ with $\backslash varphi$ a Gödel numbering of the partial computable functions $\backslash mathbf^$ and a computable function :$\backslash Phi:\; \backslash mathbb\; \backslash to\; \backslash mathbf^$ which satisfies the following Blum axioms. We write $\backslash varphi\_i$ for the ''i''-th partial computable function under the Gödel numbering $\backslash varphi$, and $\backslash Phi\_i$ for the partial computable function $\backslash Phi(i)$. * the domains of $\backslash varphi\_i$ and $\backslash Phi\_i$ are identical. * the set $\backslash$ is recursive. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Blum axioms」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.